Solving Initial – Value Problems by Explicit Domain Decomposition Approximate Inverses
نویسنده
چکیده
A class of hybrid heterogeneous methods using time implicit backward differences and Crank-Nicolson approximating schemes in conjunction with explicit domain decomposition approximate inverse matrix techniques is introduced for computing various families of approximate inverses based on approximate LU-type factorization techniques. Explicit preconditioned conjugate gradient type schemes in conjunction with approximate inverse matrix techniques are presented for the efficient solution of linear systems. Application of the new proposed hybrid method on a 2D initial value problem is discussed and numerical results are given.
منابع مشابه
Approximate Solution of the Second Order Initial Value Problem by Using Epsilon Modified Block-Pulse Function
The present work approaches the problem of achieving the approximate solution of the second order initial value problems (IVPs) via its conversion into a Volterra integral equation of the second kind (VIE2). Therefore, we initially solve the IVPs using Runge–Kutta of the forth–order method (RK), and then convert it into VIE2, and apply the εmodified block–pulse functions (εMBPFs) and their oper...
متن کاملModified Laplace Decomposition Method for Singular IVPs in the second-Order Ordinary Differential Equations
In this paper, we use modified Laplace decomposition method to solving initial value problems (IVP) of the second order ordinary differential equations. Theproposed method can be applied to linear and nonlinearproblems
متن کاملA Domain Decomposition Method for Computing Bivariate Spline Fits of Scattered Data
A domain decomposition method for solving large bivariate scattered data fitting problems with bivariate minimal energy, discrete least-squares, and penalized least-squares splines is described. The method is based on splitting the domain into smaller domains, solving the associated smaller fitting problems, and combining the coefficients to get a global fit. Explicit error bounds are establish...
متن کاملCombining Multilevel Preconditioners with Domain Decomposition for Solving Linear Systems
Algebraic multilevel techniques for defining preconditioners have proven to bevery effective when used with Krylov methods. In most cases, they can solvelinear systems arising from the dicretization of PDEs with a number of floatingpoint operations proportional to the number of unknowns. To be efficient onparallel computers these multilevel techniques must use parallel smoothers...
متن کاملSolving Differential Equations by Using a Combination of the First Kind Chebyshev Polynomials and Adomian Decomposition Method
In this paper, we are going to solve a class of ordinary differential equations that its source term are rational functions. We obtain the best approximation of source term by Chebyshev polynomials of the first kind, then we solve the ordinary differential equations by using the Adomian decomposition method
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000